1991D - Prime XOR Coloring - CodeForces Solution


bitmasks constructive algorithms graphs greedy math number theory

Please click on ads to support us..

Python Code:

n= int(input())
for i in range(n):
    m= int(input())
        ans = [0]*m
    if m==1:
        print(1)
        ans =[1]
        print(*ans,sep=" ")
    elif m==2:
        print(2)
        ans =[1,2]
        print(*ans,sep=" ")
    elif m==3:
        print(2)
        ans =[1,2,2]
        print(*ans,sep=" ")
    elif m==4:
        print(3)
        ans =[1,2,2,3]
        print(*ans,sep=" ")
    elif m==5:
        print(3)
        ans =[1,2,2,3,3]
        print(*ans,sep=" ")
    elif m==6:
        print(4)
        ans =[1,2,2,3,3,4]
        print(*ans,sep=" ")
    else:
        print(4)
        for j in range(m):
            ans[j] = j%4 +1 
        print(*ans, sep =" ")


Comments

Submit
0 Comments
More Questions

1610A - Anti Light's Cell Guessing
349B - Color the Fence
144A - Arrival of the General
1106A - Lunar New Year and Cross Counting
58A - Chat room
230A - Dragons
200B - Drinks
13A - Numbers
129A - Cookies
1367B - Even Array
136A - Presents
1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps
1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins